Unambiguous equal matrix languages
نویسندگان
چکیده
منابع مشابه
Channel Capacity of Equal Matrix Languages
where f l , are in V~ Equal matrix languages (abbreviated E M L ) have the interesting property that the corresponding Parikh mappings are semilinear (Siromoney, 1969a, 1969b). Further, every equal matrix grammar (abbreviated E M G ) is nonterminal bounded in the sense that in any line of a derivation the total number of nonterminals is less than a constant. This concept of nonterminal boundedn...
متن کاملOne-Unambiguous Regular Languages
The ISO standard for the Standard Generalized Markup Language (SGML) provides a syntactic meta-language for the definition of textual markup systems. In the standard, the right-hand sides of productions are based on regular expressions, although only regular expressions that denote words unambiguously, in the sense of the ISO standard, are allowed. In general, a word that is denoted by a regula...
متن کاملPAC-Learning Unambiguous NTS Languages
Non-terminally separated (NTS) languages are a subclass of deterministic context free languages where there is a stable relationship between the substrings of the language and the non-terminals of the grammar. We show that when the distribution of samples is generated by a PCFG, based on the same grammar as the target language, the class of unambiguous NTS languages is PAC-learnable from positi...
متن کاملUnambiguous languages exhaust the index hierarchy
This work is a study of the expressive power of unambiguity in the case of infinite trees. An automaton is called unambiguous if it has at most one accepting run on every input, the language of such an automaton is called an unambiguous language. It is known that not every regular language of infinite trees is unambiguous. Except that, very little is known about which regular tree languages are...
متن کاملLogic for Unambiguous Context-Free Languages
We give in this paper a logical characterization for unambiguous Context Free Languages, in the vein of descriptive complexity. A fragment of the logic characterizing context free languages given by Lautemann, Schwentick and Thérien based on implicit definability is used for this aim. We obtain a new connection between two undecidable problems, a logical one and a language theoretical one.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1972
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(72)90233-1